A Note on Adaptivity in Testing Properties of Bounded Degree Graphs
نویسندگان
چکیده
We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving any answers. We call a property non-trivial if it does not depend only on the degree distribution of the nodes. We show that every tester for a non-trivial property that makes o ( √ n/d) queries to the input graph on n vertices of degree at most d has to be adaptive.
منابع مشابه
On the Benfits of Adaptivity in Property Testing of Dense Graphs
We consider the question of whether adaptivity can improve the complexity of property testing algorithms in the dense graphs model. Goldreich and Trevisan (Random Structures and Algorithms, 2003) have shown that there can be at most a quadratic gap between adaptive and non-adaptive testers in this model, but it was not known whether any gap indeed exists. In this work we reveal such a gap. Spec...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملTesting Hereditary Properties of Nonexpanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is believed that almost all, even very simple graph properties require a large complexity to be tested for arbitrary (bounded degree) graphs....
متن کاملA note on vague graphs
In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.
متن کاملHomomorphisms on Topological Groups from the Perspective of Bourbaki-boundedness
In this note we study some topological properties of bounded sets and Bourbaki-bounded sets. Also we introduce two types of Bourbaki-bounded homomorphisms on topological groups including, n$-$Bourbaki-bounded homomorphisms and$hspace{1mm}$ B$-$Bourbaki-bounded homomorphisms. We compare them to each other and with the class of continuous homomorphisms. So, two topologies are presented on them a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 13 شماره
صفحات -
تاریخ انتشار 2006